On the Use of Lagrange Multipliers in Domain Decomposition for Solving Elliptic Problems

نویسنده

  • HOWARD SWANN
چکیده

The primal hybrid method for solving second-order elliptic equations is extended from finite element approximations to general bases. Variational techniques are used to show convergence of approximations to the solution of the homogeneous Dirichlet problem for selfadjoint equations. Error estimates are obtained and examples are given. Introduction Lagrange multipliers have been employed to define classes of functions used to approximate solutions of elliptic partial differential equations in a number of ways. Greenstadt has described the cell discretization method, where the domain of a problem is partitioned into cells; approximations are made on each cell, and the approximations are forced to be weakly continuous across the boundaries of each cell by using Lagrange multipliers in a method called moment collocation [5, 6, 13-16]. These results are discussed in §4. Babuska has shown how Lagrange multipliers can be used to make finite element approximations match the boundary data in elliptic problems [1] (see also [4]). Dorr [9] has applied the methods of Babuska to force continuity across an internal interface formed by dividing a domain in R2 into two parts, using a finite element basis. The primal hybrid finite element method of Raviart and Thomas [18] shows how Lagrange multipliers can be used to ensure that nonconforming finite element approximations converge to solutions as the size of the mesh of the finite element grid becomes small. We show here that convergence of the Greenstadt method occurs in quite general situations. The cells do not diminish in size. The only requirement for convergence is that the basis functions on each cell constitute a Schauder basis in an appropriate space and that the weight functions defined on the boundary segments of each cell that are used to enforce moment collocation also be a Schauder basis. The algorithm is naturally suited for parallel computational methods. Received by the editor November 26, 1990 and, in revised form, October 3, 1991. 1991 Mathematics Subject Classification. Primary 65N30; Secondary 65N35, 65N15.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A spectral fictitious domain method with internal forcing for solving elliptic PDEs

A fictitious domain method is presented for solving elliptic partial differential equations using Galerkin spectral approximation. The fictitious domain approach consists in immersing the original domain into a larger and geometrically simpler one in order to avoid the use of boundary fitted or unstructured meshes. In the present study, boundary constraints are enforced using Lagrange multiplie...

متن کامل

A Neural Network Method Based on Mittag-Leffler Function for Solving a Class of Fractional Optimal Control Problems

In this paper, a computational intelligence method is used for the solution of fractional optimal control problems (FOCP)'s with equality and inequality constraints. According to the Ponteryagin minimum principle (PMP) for FOCP with fractional derivative in the Riemann- Liouville sense and by constructing a suitable error function, we define an unconstrained minimization problem. In the optimiz...

متن کامل

A Nonoverlapping Subdomain Algorithm with Lagrange Multipliers and its Object Oriented Implementation for Interface Problems

A parallel nonoverlapping subdomain Schwarz alternating algorithm with Lagrange multipliers and interface relaxation is proposed for linear elliptic interface problems with discontinuities in the solution, its derivatives, and the coefficients. New features of the algorithm include that Lagrange multipliers are introduced on the interface and that it is used to solve equations with discontinuou...

متن کامل

2 Charbel Farhat And

We present a formulation of the FETI substructuring method as a matrix preconditioning algorithm and report on theoretical results and practical experience in large scale parallel implementations. The method has quasi-optimal convergence properties: the condition number can be proved to be independent of the number of subdomains, and to grow at most polylogarithmically with the number of elemen...

متن کامل

A Parallel Nonoverlapping Schwarz Domain Decomposition Method for Elliptic Interface Problems

We present a parallel nonoverlapping Schwarz domain decomposition method with interface relaxation for linear elliptic problems, possibly with discontinuities in the solution and its derivatives. This domain decomposition method can be characterized as: the transmission conditions at the interface of subdomains are taken to be Dirichlet at odd iterations and Neumann at even iterations. The conv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010